Coalitional matchings

نویسندگان

  • Dinko Dimitrov
  • Emiliya Lazarova
چکیده

In a coalitional two-sided matching problem agents on each side of the market may form coalitions such as student groups and research teams who – when matched – form universities. We assume that each researcher has preferences over the research teams he would like to work in and over the student groups he would like to teach to. Correspondingly, each student has preferences over the groups of students he wants to study with and over the teams of researchers he would like to learn from. In this setup, we examine how the existence of core stable partitions on the distinct market sides, the restriction of agents’ preferences over groups to strict orderings, and the extent to which individual preferences respect common rankings shape the existence of core stable coalitional matchings.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Coalitional Exchange Stable Matchings in Marriage and Roommate Markets

We consider the stable roommates problem with respect to the stability based on exchange of agents. We present three natural variants of coalitional exchange stability and identify the relations between them. We also present a number of impossibility results. In particular, we show that even a (standard) exchange stable matching may not exist for dichotomous preferences. We prove that exchange ...

متن کامل

Two Coalitional Models for Network Formation and Matching Games

This thesis comprises of two separate game theoretic models that fall under the general umbrella of network formation games. The first is a coalitional model of interaction in social networks that is based on the idea of social distance, in which players seek interactions with similar others. Our model captures some of the phenomena observed on such networks, such as homophily driven interactio...

متن کامل

Credible Group-Stability in General Multi-Partner Matching Problems∗

Pairwise-stable matching mechanisms are practically used and perform very well in the real world two-sided matching markets (e.g., the US hospital-intern market, and the British hospital-intern markets: see Roth 1984 and 1991, respectively). It is known, however, that in a twosided many-to-many matching market (the British market), pairwisestability is not logically related with the (weak) core...

متن کامل

COALITIONAL GAME WITH FUZZY PAYOFFS AND CREDIBILISTIC SHAPLEY VALUE

Coalitional game deals with situations that involve cooperations among players, and there are different solution concepts such as the core,the Shapley value and the kernel. In many situations, there is no way to predict the payoff functions except for the expert experiencesand subjective intuitions, which leads to the coalitional game with fuzzy payoffs. Within the framework of credibility theo...

متن کامل

Perfect Matchings in Edge-Transitive Graphs

We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008